0.12/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.12	% Command    : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM
0.12/0.34	% Computer : n025.cluster.edu
0.12/0.34	% Model    : x86_64 x86_64
0.12/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory   : 8042.1875MB
0.12/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 1920
0.12/0.34	% WCLimit    : 240
0.12/0.34	% DateTime   : Wed Jul 30 02:42:04 EDT 2025
0.12/0.34	% CPUTime    : 
0.20/0.49	Running higher-order theorem proving
0.20/0.50	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.U7Riy5vGRW/E---3.1_28721.p
0.20/0.58	# Version: 3.0.0-ho
0.20/0.58	# Preprocessing class: HSSSSLSSSLMNSSA.
0.20/0.58	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.58	# Starting new_ho_10 with 1200s (5) cores
0.20/0.58	# Starting new_bool_2 with 240s (1) cores
0.20/0.58	# Starting new_bool_9 with 240s (1) cores
0.20/0.58	# Starting ehoh_best_sine_rwall with 240s (1) cores
0.20/0.58	# new_ho_10 with pid 28799 completed with status 0
0.20/0.58	# Result found by new_ho_10
0.20/0.58	# Preprocessing class: HSSSSLSSSLMNSSA.
0.20/0.58	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.58	# Starting new_ho_10 with 1200s (5) cores
0.20/0.58	# No SInE strategy applied
0.20/0.58	# Search class: HGUSF-FFSF22-SSSFMSBN
0.20/0.58	# Scheduled 5 strats onto 5 cores with 1200 seconds (1200 total)
0.20/0.58	# Starting new_ho_10 with 721s (1) cores
0.20/0.58	# Starting new_bool_2 with 121s (1) cores
0.20/0.58	# Starting new_bool_9 with 121s (1) cores
0.20/0.58	# Starting ehoh_best8_lambda with 121s (1) cores
0.20/0.58	# Starting new_bool_3 with 116s (1) cores
0.20/0.58	# new_ho_10 with pid 28806 completed with status 0
0.20/0.58	# Result found by new_ho_10
0.20/0.58	# Preprocessing class: HSSSSLSSSLMNSSA.
0.20/0.58	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.58	# Starting new_ho_10 with 1200s (5) cores
0.20/0.58	# No SInE strategy applied
0.20/0.58	# Search class: HGUSF-FFSF22-SSSFMSBN
0.20/0.58	# Scheduled 5 strats onto 5 cores with 1200 seconds (1200 total)
0.20/0.58	# Starting new_ho_10 with 721s (1) cores
0.20/0.58	# Preprocessing time       : 0.001 s
0.20/0.58	# Presaturation interreduction done
0.20/0.58	
0.20/0.58	# Proof found!
0.20/0.58	# SZS status Theorem
0.20/0.58	# SZS output start CNFRefutation
0.20/0.58	thf(decl_23, type, in: $i > $i > $o).
0.20/0.58	thf(decl_24, type, dsetconstr: $i > ($i > $o) > $i).
0.20/0.58	thf(decl_25, type, dsetconstrI: $o).
0.20/0.58	thf(decl_26, type, dsetconstrEL: $o).
0.20/0.58	thf(decl_27, type, dsetconstrER: $o).
0.20/0.58	thf(decl_28, type, setext: $o).
0.20/0.58	thf(decl_29, type, esk1_2: $i > $i > $i).
0.20/0.58	thf(decl_30, type, esk2_2: $i > $i > $i).
0.20/0.58	thf(decl_31, type, esk3_0: $i).
0.20/0.58	thf(decl_32, type, esk4_0: $i).
0.20/0.58	thf(decl_33, type, epred1_0: $i > $o).
0.20/0.58	thf(decl_34, type, epred2_0: $i > $o).
0.20/0.58	thf(dsetconstrI, axiom, ((dsetconstrI)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ X1)=>((X2 @ X3)=>(in @ X3 @ (dsetconstr @ X1 @ (^[X4:$i]:((X2 @ X4))))))))), file('/export/starexec/sandbox/tmp/tmp.U7Riy5vGRW/E---3.1_28721.p', dsetconstrI)).
0.20/0.58	thf(dsetconstrEL, axiom, ((dsetconstrEL)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ (dsetconstr @ X1 @ (^[X4:$i]:((X2 @ X4)))))=>(in @ X3 @ X1)))), file('/export/starexec/sandbox/tmp/tmp.U7Riy5vGRW/E---3.1_28721.p', dsetconstrEL)).
0.20/0.58	thf(dsetconstrER, axiom, ((dsetconstrER)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ (dsetconstr @ X1 @ (^[X4:$i]:((X2 @ X4)))))=>(X2 @ X3)))), file('/export/starexec/sandbox/tmp/tmp.U7Riy5vGRW/E---3.1_28721.p', dsetconstrER)).
0.20/0.58	thf(dsetconstr__Cong, conjecture, ((dsetconstrI)=>((dsetconstrEL)=>(((setext)=>![X1:$i, X5:$i]:((((X1)=(X5))=>![X2:$i > $o, X6:$i > $o]:((((dsetconstr @ X1 @ (^[X3:$i]:((X2 @ X3))))=(dsetconstr @ X5 @ (^[X3:$i]:((X6 @ X3)))))<=![X3:$i]:((![X4:$i]:(((((X2 @ X3)<=>(X6 @ X4))<=((X3)=(X4)))<=(in @ X4 @ X5)))<=(in @ X3 @ X1))))))))<=(dsetconstrER)))), file('/export/starexec/sandbox/tmp/tmp.U7Riy5vGRW/E---3.1_28721.p', dsetconstr__Cong)).
0.20/0.58	thf(setext, axiom, ((setext)<=>![X1:$i, X5:$i]:((![X3:$i]:(((in @ X3 @ X1)=>(in @ X3 @ X5)))=>(![X3:$i]:(((in @ X3 @ X5)=>(in @ X3 @ X1)))=>((X1)=(X5)))))), file('/export/starexec/sandbox/tmp/tmp.U7Riy5vGRW/E---3.1_28721.p', setext)).
0.20/0.58	thf(c_0_5, plain, ((dsetconstrI)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ X1)=>((X2 @ X3)=>(in @ X3 @ (dsetconstr @ X1 @ (^[Z0/* 3 */:$i]:((X2 @ Z0))))))))), inference(fof_simplification,[status(thm)],[dsetconstrI])).
0.20/0.58	thf(c_0_6, plain, ((dsetconstrEL)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ (dsetconstr @ X1 @ (^[Z0/* 3 */:$i]:((X2 @ Z0)))))=>(in @ X3 @ X1)))), inference(fof_simplification,[status(thm)],[dsetconstrEL])).
0.20/0.58	thf(c_0_7, plain, ((dsetconstrER)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ (dsetconstr @ X1 @ (^[Z0/* 3 */:$i]:((X2 @ Z0)))))=>(X2 @ X3)))), inference(fof_simplification,[status(thm)],[dsetconstrER])).
0.20/0.58	thf(c_0_8, negated_conjecture, ~((![X26:$i, X27:$i > $o, X28:$i]:(((in @ X28 @ X26)=>((X27 @ X28)=>(in @ X28 @ (dsetconstr @ X26 @ X27)))))=>(![X29:$i, X30:$i > $o, X31:$i]:(((in @ X31 @ (dsetconstr @ X29 @ X30))=>(in @ X31 @ X29)))=>(![X36:$i, X37:$i > $o, X38:$i]:(((in @ X38 @ (dsetconstr @ X36 @ X37))=>(X37 @ X38)))=>(![X32:$i, X33:$i]:((![X34:$i]:(((in @ X34 @ X32)=>(in @ X34 @ X33)))=>(![X35:$i]:(((in @ X35 @ X33)=>(in @ X35 @ X32)))=>((X32)=(X33)))))=>![X1:$i, X5:$i]:((((X1)=(X5))=>![X2:$i > $o, X6:$i > $o]:((![X3:$i]:(((in @ X3 @ X1)=>![X4:$i]:(((in @ X4 @ X5)=>(((X3)=(X4))=>((X2 @ X3)<=>(X6 @ X4)))))))=>((dsetconstr @ X1 @ X2)=(dsetconstr @ X5 @ X6))))))))))), inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[dsetconstr__Cong])]), c_0_5]), c_0_6]), c_0_7]), setext])])])).
0.20/0.58	thf(c_0_9, negated_conjecture, ![X39:$i, X40:$i > $o, X41:$i, X42:$i, X43:$i > $o, X44:$i, X45:$i, X46:$i > $o, X47:$i, X48:$i, X49:$i, X56:$i, X57:$i]:(((~(in @ X41 @ X39)|(~(X40 @ X41)|(in @ X41 @ (dsetconstr @ X39 @ X40))))&((~(in @ X44 @ (dsetconstr @ X42 @ X43))|(in @ X44 @ X42))&((~(in @ X47 @ (dsetconstr @ X45 @ X46))|(X46 @ X47))&(((((in @ (esk2_2 @ X48 @ X49) @ X49)|((X48)=(X49))|(in @ (esk1_2 @ X48 @ X49) @ X48))&(~(in @ (esk2_2 @ X48 @ X49) @ X48)|((X48)=(X49))|(in @ (esk1_2 @ X48 @ X49) @ X48)))&(((in @ (esk2_2 @ X48 @ X49) @ X49)|((X48)=(X49))|~(in @ (esk1_2 @ X48 @ X49) @ X49))&(~(in @ (esk2_2 @ X48 @ X49) @ X48)|((X48)=(X49))|~(in @ (esk1_2 @ X48 @ X49) @ X49))))&(((esk3_0)=(esk4_0))&(((~(epred1_0 @ X56)|(epred2_0 @ X57)|((X56)!=(X57))|~(in @ X57 @ esk4_0)|~(in @ X56 @ esk3_0))&(~(epred2_0 @ X57)|(epred1_0 @ X56)|((X56)!=(X57))|~(in @ X57 @ esk4_0)|~(in @ X56 @ esk3_0)))&((dsetconstr @ esk3_0 @ epred1_0)!=(dsetconstr @ esk4_0 @ epred2_0))))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])])).
0.20/0.58	thf(c_0_10, negated_conjecture, ![X1:$i, X3:$i]:(((epred1_0 @ X3)|~((epred2_0 @ X1))|((X3)!=(X1))|~((in @ X1 @ esk4_0))|~((in @ X3 @ esk3_0)))), inference(split_conjunct,[status(thm)],[c_0_9])).
0.20/0.58	thf(c_0_11, negated_conjecture, ((esk3_0)=(esk4_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
0.20/0.58	thf(c_0_12, negated_conjecture, ![X1:$i, X3:$i, X2:$i > $o]:(((in @ X1 @ X3)|~((in @ X1 @ (dsetconstr @ X3 @ X2))))), inference(split_conjunct,[status(thm)],[c_0_9])).
0.20/0.58	thf(c_0_13, negated_conjecture, ![X3:$i, X1:$i]:(((in @ (esk2_2 @ X1 @ X3) @ X3)|((X1)=(X3))|(in @ (esk1_2 @ X1 @ X3) @ X1))), inference(split_conjunct,[status(thm)],[c_0_9])).
0.20/0.58	thf(c_0_14, negated_conjecture, ![X1:$i, X3:$i, X2:$i > $o]:(((X2 @ X1)|~((in @ X1 @ (dsetconstr @ X3 @ X2))))), inference(split_conjunct,[status(thm)],[c_0_9])).
0.20/0.58	thf(c_0_15, negated_conjecture, ![X3:$i, X1:$i]:((((X1)=(X3))|(in @ (esk1_2 @ X1 @ X3) @ X1)|~((in @ (esk2_2 @ X1 @ X3) @ X1)))), inference(split_conjunct,[status(thm)],[c_0_9])).
0.20/0.58	thf(c_0_16, negated_conjecture, ![X3:$i, X2:$i > $o, X1:$i]:(((in @ X1 @ (dsetconstr @ X3 @ X2))|~((in @ X1 @ X3))|~((X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_9])).
0.20/0.58	thf(c_0_17, negated_conjecture, ![X1:$i]:(((epred1_0 @ X1)|~((in @ X1 @ esk3_0))|~((epred2_0 @ X1)))), inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_10, c_0_11])])).
0.20/0.58	thf(c_0_18, negated_conjecture, ![X1:$i, X2:$i > $o, X3:$i]:((((X1)=(dsetconstr @ X3 @ X2))|(in @ (esk1_2 @ X1 @ (dsetconstr @ X3 @ X2)) @ X1)|(in @ (esk2_2 @ X1 @ (dsetconstr @ X3 @ X2)) @ X3))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
0.20/0.58	thf(c_0_19, negated_conjecture, ![X3:$i, X1:$i]:(((epred2_0 @ X3)|~((epred1_0 @ X1))|((X1)!=(X3))|~((in @ X3 @ esk4_0))|~((in @ X1 @ esk3_0)))), inference(split_conjunct,[status(thm)],[c_0_9])).
0.20/0.58	thf(c_0_20, negated_conjecture, ![X1:$i, X3:$i, X2:$i > $o]:((((X1)=(dsetconstr @ X3 @ X2))|(in @ (esk1_2 @ X1 @ (dsetconstr @ X3 @ X2)) @ X1)|(X2 @ (esk2_2 @ X1 @ (dsetconstr @ X3 @ X2))))), inference(spm,[status(thm)],[c_0_14, c_0_13])).
0.20/0.58	thf(c_0_21, negated_conjecture, ![X1:$i, X2:$i > $o, X3:$i]:((((dsetconstr @ X1 @ X2)=(X3))|(in @ (esk1_2 @ (dsetconstr @ X1 @ X2) @ X3) @ (dsetconstr @ X1 @ X2))|~((in @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ X3) @ X1))|~((X2 @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ X3))))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
0.20/0.58	thf(c_0_22, negated_conjecture, ![X1:$i, X2:$i > $o, X3:$i]:((((dsetconstr @ X1 @ X2)=(X3))|(in @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ X3) @ X3)|(X2 @ (esk1_2 @ (dsetconstr @ X1 @ X2) @ X3)))), inference(spm,[status(thm)],[c_0_14, c_0_13])).
0.20/0.58	thf(c_0_23, negated_conjecture, ![X1:$i, X2:$i > $o]:((((X1)=(dsetconstr @ esk3_0 @ X2))|(in @ (esk1_2 @ X1 @ (dsetconstr @ esk3_0 @ X2)) @ X1)|(epred1_0 @ (esk2_2 @ X1 @ (dsetconstr @ esk3_0 @ X2)))|~((epred2_0 @ (esk2_2 @ X1 @ (dsetconstr @ esk3_0 @ X2)))))), inference(spm,[status(thm)],[c_0_17, c_0_18])).
0.20/0.58	thf(c_0_24, negated_conjecture, ![X1:$i]:(((epred2_0 @ X1)|~((in @ X1 @ esk3_0))|~((epred1_0 @ X1)))), inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_19, c_0_11])])).
0.20/0.58	thf(c_0_25, negated_conjecture, ![X1:$i, X2:$i > $o, X3:$i, X6:$i > $o]:((((dsetconstr @ X1 @ X2)=(dsetconstr @ X3 @ X6))|(in @ (esk1_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ X3 @ X6)) @ X1)|(X6 @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ X3 @ X6))))), inference(spm,[status(thm)],[c_0_12, c_0_20])).
0.20/0.58	thf(c_0_26, negated_conjecture, ![X1:$i, X2:$i > $o, X3:$i]:((((dsetconstr @ X1 @ X2)=(X3))|(X2 @ (esk1_2 @ (dsetconstr @ X1 @ X2) @ X3))|~((in @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ X3) @ X1))|~((X2 @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ X3))))), inference(spm,[status(thm)],[c_0_14, c_0_21])).
0.20/0.58	thf(c_0_27, negated_conjecture, ![X1:$i, X2:$i > $o, X3:$i, X6:$i > $o]:((((dsetconstr @ X1 @ X2)=(dsetconstr @ X3 @ X6))|(in @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ X3 @ X6)) @ X3)|(X2 @ (esk1_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ X3 @ X6))))), inference(spm,[status(thm)],[c_0_12, c_0_22])).
0.20/0.58	thf(c_0_28, negated_conjecture, ![X1:$i, X2:$i > $o, X6:$i > $o]:((((dsetconstr @ X1 @ X2)=(dsetconstr @ esk3_0 @ X6))|(epred1_0 @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ esk3_0 @ X6)))|(X2 @ (esk1_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ esk3_0 @ X6)))|~((epred2_0 @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ esk3_0 @ X6)))))), inference(spm,[status(thm)],[c_0_14, c_0_23])).
0.20/0.58	thf(c_0_29, negated_conjecture, ![X1:$i, X2:$i > $o, X3:$i, X6:$i > $o]:((((dsetconstr @ X1 @ X2)=(dsetconstr @ X3 @ X6))|(X6 @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ X3 @ X6)))|(X2 @ (esk1_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ X3 @ X6))))), inference(spm,[status(thm)],[c_0_14, c_0_20])).
0.20/0.58	thf(c_0_30, negated_conjecture, ((dsetconstr @ esk3_0 @ epred1_0)!=(dsetconstr @ esk4_0 @ epred2_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
0.20/0.58	thf(c_0_31, negated_conjecture, ![X1:$i, X3:$i]:(((in @ (esk2_2 @ X1 @ X3) @ X3)|((X1)=(X3))|~((in @ (esk1_2 @ X1 @ X3) @ X3)))), inference(split_conjunct,[status(thm)],[c_0_9])).
0.20/0.58	thf(c_0_32, negated_conjecture, ![X1:$i, X2:$i > $o, X6:$i > $o]:((((dsetconstr @ X1 @ X2)=(dsetconstr @ esk3_0 @ X6))|(in @ (esk1_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ esk3_0 @ X6)) @ X1)|(epred1_0 @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ esk3_0 @ X6)))|~((epred2_0 @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ esk3_0 @ X6)))))), inference(spm,[status(thm)],[c_0_12, c_0_23])).
0.20/0.58	thf(c_0_33, negated_conjecture, ![X1:$i, X2:$i > $o, X6:$i > $o]:((((dsetconstr @ esk3_0 @ X2)=(dsetconstr @ X1 @ X6))|(epred2_0 @ (esk1_2 @ (dsetconstr @ esk3_0 @ X2) @ (dsetconstr @ X1 @ X6)))|(X6 @ (esk2_2 @ (dsetconstr @ esk3_0 @ X2) @ (dsetconstr @ X1 @ X6)))|~((epred1_0 @ (esk1_2 @ (dsetconstr @ esk3_0 @ X2) @ (dsetconstr @ X1 @ X6)))))), inference(spm,[status(thm)],[c_0_24, c_0_25])).
0.20/0.58	thf(c_0_34, negated_conjecture, ![X1:$i, X2:$i > $o, X6:$i > $o]:((((dsetconstr @ X1 @ X2)=(dsetconstr @ X1 @ X6))|(X2 @ (esk1_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ X1 @ X6)))|~((X2 @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ X1 @ X6)))))), inference(spm,[status(thm)],[c_0_26, c_0_27])).
0.20/0.58	thf(c_0_35, negated_conjecture, ![X1:$i, X2:$i > $o]:((((dsetconstr @ X1 @ X2)=(dsetconstr @ esk3_0 @ epred2_0))|(epred1_0 @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ esk3_0 @ epred2_0)))|(X2 @ (esk1_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ esk3_0 @ epred2_0))))), inference(spm,[status(thm)],[c_0_28, c_0_29])).
0.20/0.58	thf(c_0_36, negated_conjecture, ((dsetconstr @ esk3_0 @ epred2_0)!=(dsetconstr @ esk3_0 @ epred1_0)), inference(rw,[status(thm)],[c_0_30, c_0_11])).
0.20/0.58	thf(c_0_37, negated_conjecture, ![X1:$i, X3:$i, X2:$i > $o]:((((X1)=(dsetconstr @ X3 @ X2))|(in @ (esk2_2 @ X1 @ (dsetconstr @ X3 @ X2)) @ X3)|~((in @ (esk1_2 @ X1 @ (dsetconstr @ X3 @ X2)) @ (dsetconstr @ X3 @ X2))))), inference(spm,[status(thm)],[c_0_12, c_0_31])).
0.20/0.58	thf(c_0_38, negated_conjecture, ![X2:$i > $o, X6:$i > $o]:((((dsetconstr @ esk3_0 @ X2)=(dsetconstr @ esk3_0 @ X6))|(epred1_0 @ (esk2_2 @ (dsetconstr @ esk3_0 @ X2) @ (dsetconstr @ esk3_0 @ X6)))|(epred2_0 @ (esk1_2 @ (dsetconstr @ esk3_0 @ X2) @ (dsetconstr @ esk3_0 @ X6)))|~((epred1_0 @ (esk1_2 @ (dsetconstr @ esk3_0 @ X2) @ (dsetconstr @ esk3_0 @ X6))))|~((epred2_0 @ (esk2_2 @ (dsetconstr @ esk3_0 @ X2) @ (dsetconstr @ esk3_0 @ X6)))))), inference(spm,[status(thm)],[c_0_24, c_0_32])).
0.20/0.58	thf(c_0_39, negated_conjecture, ![X1:$i, X2:$i > $o]:((((dsetconstr @ esk3_0 @ epred1_0)=(dsetconstr @ X1 @ X2))|(epred2_0 @ (esk1_2 @ (dsetconstr @ esk3_0 @ epred1_0) @ (dsetconstr @ X1 @ X2)))|(X2 @ (esk2_2 @ (dsetconstr @ esk3_0 @ epred1_0) @ (dsetconstr @ X1 @ X2))))), inference(spm,[status(thm)],[c_0_33, c_0_29])).
0.20/0.58	thf(c_0_40, negated_conjecture, (epred1_0 @ (esk1_2 @ (dsetconstr @ esk3_0 @ epred1_0) @ (dsetconstr @ esk3_0 @ epred2_0))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35]), c_0_36])).
0.20/0.58	thf(c_0_41, negated_conjecture, ![X1:$i, X3:$i, X2:$i > $o]:((((X1)=(dsetconstr @ X3 @ X2))|(in @ (esk2_2 @ X1 @ (dsetconstr @ X3 @ X2)) @ X3)|~((in @ (esk1_2 @ X1 @ (dsetconstr @ X3 @ X2)) @ X3))|~((X2 @ (esk1_2 @ X1 @ (dsetconstr @ X3 @ X2)))))), inference(spm,[status(thm)],[c_0_37, c_0_16])).
0.20/0.58	thf(c_0_42, negated_conjecture, ((epred2_0 @ (esk1_2 @ (dsetconstr @ esk3_0 @ epred1_0) @ (dsetconstr @ esk3_0 @ epred2_0)))|(epred1_0 @ (esk2_2 @ (dsetconstr @ esk3_0 @ epred1_0) @ (dsetconstr @ esk3_0 @ epred2_0)))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_39]), c_0_40])]), c_0_36])).
0.20/0.58	thf(c_0_43, negated_conjecture, ((in @ (esk2_2 @ (dsetconstr @ esk3_0 @ epred1_0) @ (dsetconstr @ esk3_0 @ epred2_0)) @ esk3_0)|(epred1_0 @ (esk2_2 @ (dsetconstr @ esk3_0 @ epred1_0) @ (dsetconstr @ esk3_0 @ epred2_0)))|~((in @ (esk1_2 @ (dsetconstr @ esk3_0 @ epred1_0) @ (dsetconstr @ esk3_0 @ epred2_0)) @ esk3_0))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41, c_0_42]), c_0_36])).
0.20/0.58	thf(c_0_44, negated_conjecture, ![X1:$i, X3:$i, X2:$i > $o]:((((X1)=(dsetconstr @ X3 @ X2))|(X2 @ (esk2_2 @ X1 @ (dsetconstr @ X3 @ X2)))|~((in @ (esk1_2 @ X1 @ (dsetconstr @ X3 @ X2)) @ (dsetconstr @ X3 @ X2))))), inference(spm,[status(thm)],[c_0_14, c_0_31])).
0.20/0.58	thf(c_0_45, negated_conjecture, ((epred1_0 @ (esk2_2 @ (dsetconstr @ esk3_0 @ epred1_0) @ (dsetconstr @ esk3_0 @ epred2_0)))|~((in @ (esk1_2 @ (dsetconstr @ esk3_0 @ epred1_0) @ (dsetconstr @ esk3_0 @ epred2_0)) @ esk3_0))|~((epred2_0 @ (esk2_2 @ (dsetconstr @ esk3_0 @ epred1_0) @ (dsetconstr @ esk3_0 @ epred2_0))))), inference(spm,[status(thm)],[c_0_17, c_0_43])).
0.20/0.58	thf(c_0_46, negated_conjecture, ![X1:$i, X3:$i, X2:$i > $o]:((((X1)=(dsetconstr @ X3 @ X2))|(X2 @ (esk2_2 @ X1 @ (dsetconstr @ X3 @ X2)))|~((in @ (esk1_2 @ X1 @ (dsetconstr @ X3 @ X2)) @ X3))|~((X2 @ (esk1_2 @ X1 @ (dsetconstr @ X3 @ X2)))))), inference(spm,[status(thm)],[c_0_44, c_0_16])).
0.20/0.58	thf(c_0_47, negated_conjecture, ![X1:$i, X2:$i > $o, X3:$i]:((((dsetconstr @ X1 @ X2)=(X3))|(in @ (esk1_2 @ (dsetconstr @ X1 @ X2) @ X3) @ X1)|~((in @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ X3) @ X1))|~((X2 @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ X3))))), inference(spm,[status(thm)],[c_0_12, c_0_21])).
0.20/0.58	thf(c_0_48, negated_conjecture, ![X2:$i > $o, X6:$i > $o, X3:$i, X1:$i]:((((dsetconstr @ X1 @ X2)=(dsetconstr @ X3 @ X6))|(in @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ X3 @ X6)) @ X3)|(in @ (esk1_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ X3 @ X6)) @ X1))), inference(spm,[status(thm)],[c_0_12, c_0_18])).
0.20/0.58	thf(c_0_49, negated_conjecture, ((epred1_0 @ (esk2_2 @ (dsetconstr @ esk3_0 @ epred1_0) @ (dsetconstr @ esk3_0 @ epred2_0)))|~((epred2_0 @ (esk2_2 @ (dsetconstr @ esk3_0 @ epred1_0) @ (dsetconstr @ esk3_0 @ epred2_0))))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_32]), c_0_36])).
0.20/0.58	thf(c_0_50, negated_conjecture, ![X1:$i, X2:$i > $o, X6:$i > $o]:((((dsetconstr @ X1 @ X2)=(dsetconstr @ X1 @ X6))|(X6 @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ X1 @ X6)))|~((X6 @ (esk1_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ X1 @ X6)))))), inference(spm,[status(thm)],[c_0_46, c_0_25])).
0.20/0.58	thf(c_0_51, negated_conjecture, ![X1:$i, X2:$i > $o, X6:$i > $o]:((((dsetconstr @ X1 @ X2)=(dsetconstr @ X1 @ X6))|(in @ (esk1_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ X1 @ X6)) @ X1)|~((X2 @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ X1 @ X6)))))), inference(spm,[status(thm)],[c_0_47, c_0_48])).
0.20/0.58	thf(c_0_52, negated_conjecture, (epred1_0 @ (esk2_2 @ (dsetconstr @ esk3_0 @ epred1_0) @ (dsetconstr @ esk3_0 @ epred2_0))), inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49, c_0_50]), c_0_36]), c_0_42])).
0.20/0.58	thf(c_0_53, negated_conjecture, ![X1:$i, X3:$i]:((((X1)=(X3))|~((in @ (esk2_2 @ X1 @ X3) @ X1))|~((in @ (esk1_2 @ X1 @ X3) @ X3)))), inference(split_conjunct,[status(thm)],[c_0_9])).
0.20/0.58	thf(c_0_54, negated_conjecture, (in @ (esk1_2 @ (dsetconstr @ esk3_0 @ epred1_0) @ (dsetconstr @ esk3_0 @ epred2_0)) @ esk3_0), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51, c_0_52]), c_0_36])).
0.20/0.58	thf(c_0_55, negated_conjecture, ![X1:$i, X3:$i, X2:$i > $o]:((((X1)=(dsetconstr @ X3 @ X2))|~((in @ (esk2_2 @ X1 @ (dsetconstr @ X3 @ X2)) @ X1))|~((in @ (esk1_2 @ X1 @ (dsetconstr @ X3 @ X2)) @ X3))|~((X2 @ (esk1_2 @ X1 @ (dsetconstr @ X3 @ X2)))))), inference(spm,[status(thm)],[c_0_53, c_0_16])).
0.20/0.58	thf(c_0_56, negated_conjecture, (epred2_0 @ (esk1_2 @ (dsetconstr @ esk3_0 @ epred1_0) @ (dsetconstr @ esk3_0 @ epred2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_54]), c_0_40])])).
0.20/0.58	thf(c_0_57, negated_conjecture, ![X1:$i, X2:$i > $o, X3:$i, X6:$i > $o]:((((dsetconstr @ X1 @ X2)=(dsetconstr @ X3 @ X6))|~((in @ (esk1_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ X3 @ X6)) @ X3))|~((in @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ X3 @ X6)) @ X1))|~((X6 @ (esk1_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ X3 @ X6))))|~((X2 @ (esk2_2 @ (dsetconstr @ X1 @ X2) @ (dsetconstr @ X3 @ X6)))))), inference(spm,[status(thm)],[c_0_55, c_0_16])).
0.20/0.58	thf(c_0_58, negated_conjecture, (in @ (esk2_2 @ (dsetconstr @ esk3_0 @ epred1_0) @ (dsetconstr @ esk3_0 @ epred2_0)) @ esk3_0), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41, c_0_56]), c_0_54])]), c_0_36])).
0.20/0.58	thf(c_0_59, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57, c_0_54]), c_0_52])]), c_0_36]), c_0_58]), c_0_56])]), ['proof']).
0.20/0.58	# SZS output end CNFRefutation
0.20/0.58	# Parsed axioms                        : 11
0.20/0.58	# Removed by relevancy pruning/SinE    : 0
0.20/0.58	# Initial clauses                      : 17
0.20/0.58	# Removed in clause preprocessing      : 6
0.20/0.58	# Initial clauses in saturation        : 11
0.20/0.58	# Processed clauses                    : 359
0.20/0.58	# ...of these trivial                  : 7
0.20/0.58	# ...subsumed                          : 159
0.20/0.58	# ...remaining for further processing  : 192
0.20/0.58	# Other redundant clauses eliminated   : 2
0.20/0.58	# Clauses deleted for lack of memory   : 0
0.20/0.58	# Backward-subsumed                    : 14
0.20/0.58	# Backward-rewritten                   : 8
0.20/0.58	# Generated clauses                    : 939
0.20/0.58	# ...of the previous two non-redundant : 864
0.20/0.58	# ...aggressively subsumed             : 0
0.20/0.58	# Contextual simplify-reflections      : 10
0.20/0.58	# Paramodulations                      : 937
0.20/0.58	# Factorizations                       : 0
0.20/0.58	# NegExts                              : 0
0.20/0.58	# Equation resolutions                 : 2
0.20/0.58	# Disequality decompositions           : 0
0.20/0.58	# Total rewrite steps                  : 100
0.20/0.58	# ...of those cached                   : 90
0.20/0.58	# Propositional unsat checks           : 0
0.20/0.58	#    Propositional check models        : 0
0.20/0.58	#    Propositional check unsatisfiable : 0
0.20/0.58	#    Propositional clauses             : 0
0.20/0.58	#    Propositional clauses after purity: 0
0.20/0.58	#    Propositional unsat core size     : 0
0.20/0.58	#    Propositional preprocessing time  : 0.000
0.20/0.58	#    Propositional encoding time       : 0.000
0.20/0.58	#    Propositional solver time         : 0.000
0.20/0.58	#    Success case prop preproc time    : 0.000
0.20/0.58	#    Success case prop encoding time   : 0.000
0.20/0.58	#    Success case prop solver time     : 0.000
0.20/0.58	# Current number of processed clauses  : 157
0.20/0.58	#    Positive orientable unit clauses  : 8
0.20/0.58	#    Positive unorientable unit clauses: 0
0.20/0.58	#    Negative unit clauses             : 1
0.20/0.58	#    Non-unit-clauses                  : 148
0.20/0.58	# Current number of unprocessed clauses: 519
0.20/0.58	# ...number of literals in the above   : 1799
0.20/0.58	# Current number of archived formulas  : 0
0.20/0.58	# Current number of archived clauses   : 33
0.20/0.58	# Clause-clause subsumption calls (NU) : 4470
0.20/0.58	# Rec. Clause-clause subsumption calls : 1509
0.20/0.58	# Non-unit clause-clause subsumptions  : 183
0.20/0.58	# Unit Clause-clause subsumption calls : 125
0.20/0.58	# Rewrite failures with RHS unbound    : 0
0.20/0.58	# BW rewrite match attempts            : 32
0.20/0.58	# BW rewrite match successes           : 3
0.20/0.58	# Condensation attempts                : 359
0.20/0.58	# Condensation successes               : 0
0.20/0.58	# Termbank termtop insertions          : 33954
0.20/0.58	# Search garbage collected termcells   : 694
0.20/0.58	
0.20/0.58	# -------------------------------------------------
0.20/0.58	# User time                : 0.066 s
0.20/0.58	# System time              : 0.003 s
0.20/0.58	# Total time               : 0.069 s
0.20/0.58	# Maximum resident set size: 1916 pages
0.20/0.58	
0.20/0.58	# -------------------------------------------------
0.20/0.58	# User time                : 0.315 s
0.20/0.58	# System time              : 0.017 s
0.20/0.58	# Total time               : 0.332 s
0.20/0.58	# Maximum resident set size: 1720 pages
0.20/0.58	% E exiting
0.20/0.58	% E exiting
0.20/0.58	EOF